Abstract Interpretation with Infinitesimals: Towards Scalability in Nonstandard Static Analysis (Extended Version)
نویسندگان
چکیده
Interpretation with Infinitesimals ? Towards Scalability in Nonstandard Static Analysis Kengo Kido, Swarat Chaudhuri, and Ichiro Hasuo 1 University of Tokyo, Japan 2 JSPS Research Fellow 3 Rice University, USA Abstract. We extend abstract interpretation for the purpose of verifying hybrid systems. Abstraction has been playing an important role in many verification methodologies for hybrid systems, but some special care is needed for abstraction of continuous dynamics defined by ODEs. We apply Cousot and Cousot’s framework of abstract interpretation to hybrid systems, almost as it is, by regarding continuous dynamics as an infinite iteration of infinitesimal discrete jumps. This extension follows the recent line of work by Suenaga, Hasuo and Sekine, where deductive verification is extended for hybrid systems by 1) introducing a constant dt for an infinitesimal value; and 2) employing Robinson’s nonstandard analysis (NSA) to define mathematically rigorous semantics. Our theoretical results include soundness and termination via uniform widening operators; and our prototype implementation successfully verifies some benchmark examples. We extend abstract interpretation for the purpose of verifying hybrid systems. Abstraction has been playing an important role in many verification methodologies for hybrid systems, but some special care is needed for abstraction of continuous dynamics defined by ODEs. We apply Cousot and Cousot’s framework of abstract interpretation to hybrid systems, almost as it is, by regarding continuous dynamics as an infinite iteration of infinitesimal discrete jumps. This extension follows the recent line of work by Suenaga, Hasuo and Sekine, where deductive verification is extended for hybrid systems by 1) introducing a constant dt for an infinitesimal value; and 2) employing Robinson’s nonstandard analysis (NSA) to define mathematically rigorous semantics. Our theoretical results include soundness and termination via uniform widening operators; and our prototype implementation successfully verifies some benchmark examples.
منابع مشابه
Towards Scalability in Nonstandard Static Analysis (
Interpretation with Infinitesimals∗ Towards Scalability in Nonstandard Static Analysis (Extended Abstract) Kengo Kido, Swarat Chaudhuri, and Ichiro Hasuo 1 University of Tokyo, Japan 2 JSPS Research Fellow 3 Rice University, USA Abstract Towards the goal of correctness and reliability of hybrid systems, we continue our nonstandard static analysis program (with Suenaga and Sekine) where hybrid d...
متن کاملAbstract Interpretation with Infinitesimals: Towards Scalability in Nonstandard Static Analysis
Interpretation with Infinitesimals Towards Scalability in Nonstandard Static Analysis Kengo Kido, Swarat Chaudhuri, and Ichiro Hasuo 1 University of Tokyo, Japan 2 Rice University, USA Abstract. Towards the goal of correctness and reliability of hybrid systems, we continue the nonstandard static analysis program where hybrid dynamics is turned into purely discrete one with explicit use of infin...
متن کاملThe Ghosts of Departed Quantities
Nonstandard analysis is the branch of mathematics concerned with constructing a number system that includes infinitesimals. These are numbers smaller than any real number yet still greater than zero. Although nonstandard analysis was developed in 1966 by Abraham Robinson, it is based off of Gottfried Wilhelm Leibniz’s construction of the calculus, created some 300 years earlier. Nonstandard ana...
متن کاملTransfer and a supremum principle for ERNA
Elementary Recursive Nonstandard Analysis, in short ERNA, is a constructive system of nonstandard analysis proposed around 1995 by Patrick Suppes and Richard Sommer, who also proved its consistency inside PRA. It is based on an earlier system developed by Rolando Chuaqui and Patrick Suppes, of which Michal Rössler and Emil Jeřábek have recently proposed a weakened version. We add a Π1-transfer ...
متن کاملFailure-Directed Program Trimming (Extended Version)
This paper describes a new program simplification technique called program trimming that aims to improve the scalability and precision of safety checking tools. Given a program P, program trimming generates a new program P ′ such that P and P ′ are equi-safe (i.e., P ′ has a bug if and only if P has a bug), but P ′ has fewer execution paths than P. Since many program analyzers are sensitive to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1511.00825 شماره
صفحات -
تاریخ انتشار 2015